doubly linked list

См. также в других словарях:

• Doubly linked list — In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the… …   Wikipedia

• Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

• XOR linked list — XOR linked lists are a data structure used in computer programming. They take advantage of the bitwise exclusive disjunction (XOR) operation, here denoted by ⊕, to decrease storage requirements for doubly linked lists. An ordinary doubly linked… …   Wikipedia

• Doubly Linked Face List — A Doubly Linked Face List or DLFL is an efficient data structure for storing 2 manifold mesh data. The structure stores linked lists for a 3D mesh s faces, edges, vertices, and corners. The structure guarantees the preservation of the manifold… …   Wikipedia

• Doubly linked face list — In applied mathematics, a doubly linked face list (DLFL) is an efficient data structure for storing 2 manifold mesh data. The structure stores linked lists for a 3D mesh s faces, edges, vertices, and corners. The structure guarantees the… …   Wikipedia

• Unrolled linked list — In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node. It can drastically increase cache performance, while decreasing the memory overhead associated with storing list… …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects …   Wikipedia

• List (computing) — In computer science, a list is an ordered collection of entities/items. In the context of object oriented programming languages, a list is defined as an instance of an abstract data type (ADT), formalizing the concept of an ordered collection of… …   Wikipedia

• Jump list — In computer science, a jump list is a data structure which resembles an ordered doubly linked list. Instead of only next and previous links, several nodes contain links to nodes farther away, with the distance increasing geometrically. This… …   Wikipedia

• Deque — In computer science theory, a deque (short for double ended queue mdash; Deque is usually pronounced deck. ) is an abstract list type data structure, also called a head tail linked list, for which elements can be added to or removed from the… …   Wikipedia